22 research outputs found

    Reactive Turing Machines

    Full text link
    We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated by a single RTM. We prove that there exist universal RTMs modulo branching bisimilarity, but these essentially employ divergence to be able to simulate an RTM of arbitrary branching degree. We also prove that modulo divergence-preserving branching bisimilarity there are RTMs that are universal up to their own branching degree. Finally, we establish a correspondence between executability and finite definability in a simple process calculus

    Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract)

    Full text link
    A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction: the set of processes given by a pushdown automaton coincides with the set of processes given by a finite guarded recursive specification over a process algebra with actions, choice, sequencing and guarded recursion, if and only if we add sequential value passing. In this paper, we look what happens if we consider parallel pushdown automata instead of pushdown automata, and a process algebra with parallelism instead of sequencing.Comment: In Proceedings EXPRESS/SOS2023, arXiv:2309.05788. arXiv admin note: text overlap with arXiv:2203.0171

    Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

    Get PDF
    The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to give a notion of interactivity. In the resulting process graph, we use bisimilarity instead of language equivalence. Subsequently, we considered other classical theorems and notions from automata theory and formal languages theory. In this paper, we consider the classical theorem of the correspondence between pushdown automata and context-free grammars. By changing the process operator of sequential composition to a sequencing operator with intermediate acceptance, we get a better correspondence in our setting. We find that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness

    Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)

    Get PDF
    The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness up to bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.Comment: In Proceedings EXPRESS'10, arXiv:1011.601

    A Process Algebra for Supervisory Coordination

    Get PDF
    A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour. Supervisory control theory studies automated synthesis of controller models, known as supervisors, based on formal models of the machine components and a formalization of the requirements. Subsequently, code generation can be used to implement this supervisor in software, on a PLC, or embedded microprocessor. In this article, we take a closer look at the control loop that couples the supervisory controller and the machine. We model both event-based and state-based observations using process algebra and bisimulation-based semantics. The main application area of supervisory control that we consider is coordination, referred to as supervisory coordination, and we give an academic and an industrial example, discussing the process-theoretic concepts employed.Comment: In Proceedings PACO 2011, arXiv:1108.145

    BIOFRAG: A new database for analysing BIOdiversity responses to forest FRAGmentation

    Get PDF
    Habitat fragmentation studies are producing inconsistent and complex results across which it is nearly impossible to synthesise. Consistent analytical techniques can be applied to primary datasets, if stored in a flexible database that allows simple data retrieval for subsequent analyses. Method: We developed a relational database linking data collected in the field to taxonomic nomenclature, spatial and temporal plot attributes and further environmental variables (e.g. information on biogeographic region. Typical field assessments include measures of biological variables (e.g. presence, abundance, ground cover) of one species or a set of species linked to a set of plots in fragments of a forested landscape. Conclusion: The database currently holds records of 5792 unique species sampled in 52 landscapes in six of eight biogeographic regions: mammals 173, birds 1101, herpetofauna 284, insects 2317, other arthropods: 48, plants 1804, snails 65. Most species are found in one or two landscapes, but some are found in four. Using the huge amount of primary data on biodiversity response to fragmentation becomes increasingly important as anthropogenic pressures from high population growth and land demands are increasing. This database can be queried to extract data for subsequent analyses of the biological response to forest fragmentation with new metrics that can integrate across the components of fragmented landscapes. Meta-analyses of findings based on consistent methods and metrics will be able to generalise over studies allowing inter-comparisons for unified answers. The database can thus help researchers in providing findings for analyses of trade-offs between land use benefits and impacts on biodiversity and to track performance of management for biodiversity conservation in human-modified landscapes.Fil: Pfeifer, Marion. Imperial College London; Reino UnidoFil: Lefebvre, Veronique. Imperial College London; Reino UnidoFil: Gardner, Toby A.. Stockholm Environment Institute; SueciaFil: Arroyo Rodríguez, Víctor. Universidad Nacional Autónoma de México; MéxicoFil: Baeten, Lander. University of Ghent; BélgicaFil: Banks Leite, Cristina. Imperial College London; Reino UnidoFil: Barlow, Jos. Lancaster University; Reino UnidoFil: Betts, Matthew G.. State University of Oregon; Estados UnidosFil: Brunet, Joerg. Swedish University of Agricultural Sciences; SueciaFil: Cerezo Blandón, Alexis Mauricio. Universidad de Buenos Aires. Facultad de Agronomía. Departamento de Métodos Cuantitativos y Sistemas de Información; ArgentinaFil: Cisneros, Laura M.. University of Connecticut; Estados UnidosFil: Collard, Stuart. Nature Conservation Society of South Australia; AustraliaFil: D´Cruze, Neil. The World Society for the Protection of Animals; Reino UnidoFil: Da Silva Motta, Catarina. Ministério da Ciência, Tecnologia, Inovações. Instituto Nacional de Pesquisas da Amazônia; BrasilFil: Duguay, Stephanie. Carleton University; CanadáFil: Eggermont, Hilde. University of Ghent; BélgicaFil: Eigenbrod, Félix. University of Southampton; Reino UnidoFil: Hadley, Adam S.. State University of Oregon; Estados UnidosFil: Hanson, Thor R.. No especifíca;Fil: Hawes, Joseph E.. University of East Anglia; Reino UnidoFil: Heartsill Scalley, Tamara. United State Department of Agriculture. Forestry Service; Puerto RicoFil: Klingbeil, Brian T.. University of Connecticut; Estados UnidosFil: Kolb, Annette. Universitat Bremen; AlemaniaFil: Kormann, Urs. Universität Göttingen; AlemaniaFil: Kumar, Sunil. State University of Colorado - Fort Collins; Estados UnidosFil: Lachat, Thibault. Swiss Federal Institute for Forest; SuizaFil: Lakeman Fraser, Poppy. Imperial College London; Reino UnidoFil: Lantschner, María Victoria. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Instituto Nacional de Tecnología Agropecuaria. Centro Regional Patagonia Norte. Estación Experimental Agropecuaria San Carlos de Bariloche; ArgentinaFil: Laurance, William F.. James Cook University; AustraliaFil: Leal, Inara R.. Universidade Federal de Pernambuco; BrasilFil: Lens, Luc. University of Ghent; BélgicaFil: Marsh, Charles J.. University of Leeds; Reino UnidoFil: Medina Rangel, Guido F.. Universidad Nacional de Colombia; ColombiaFil: Melles, Stephanie. University of Toronto; CanadáFil: Mezger, Dirk. Field Museum of Natural History; Estados UnidosFil: Oldekop, Johan A.. University of Sheffield; Reino UnidoFil: Overal , Williams L.. Museu Paraense Emílio Goeldi. Departamento de Entomologia; BrasilFil: Owen, Charlotte. Imperial College London; Reino UnidoFil: Peres, Carlos A.. University of East Anglia; Reino UnidoFil: Phalan, Ben. University of Southampton; Reino UnidoFil: Pidgeon, Anna Michle. University of Wisconsin; Estados UnidosFil: Pilia, Oriana. Imperial College London; Reino UnidoFil: Possingham, Hugh P.. Imperial College London; Reino Unido. The University Of Queensland; AustraliaFil: Possingham, Max L.. No especifíca;Fil: Raheem, Dinarzarde C.. Royal Belgian Institute of Natural Sciences; Bélgica. Natural History Museum; Reino UnidoFil: Ribeiro, Danilo B.. Universidade Federal do Mato Grosso do Sul; BrasilFil: Ribeiro Neto, Jose D.. Universidade Federal de Pernambuco; BrasilFil: Robinson, Douglas W.. State University of Oregon; Estados UnidosFil: Robinson, Richard. Manjimup Research Centre; AustraliaFil: Rytwinski, Trina. Carleton University; CanadáFil: Scherber, Christoph. Universität Göttingen; AlemaniaFil: Slade, Eleanor M.. University of Oxford; Reino UnidoFil: Somarriba, Eduardo. Centro Agronómico Tropical de Investigación y Enseñanza; Costa RicaFil: Stouffer, Philip C.. State University of Louisiana; Estados UnidosFil: Struebig, Matthew J.. University of Kent; Reino UnidoFil: Tylianakis, Jason M.. University College London; Estados Unidos. Imperial College London; Reino UnidoFil: Teja, Tscharntke. Universität Göttingen; AlemaniaFil: Tyre, Andrew J.. Universidad de Nebraska - Lincoln; Estados UnidosFil: Urbina Cardona, Jose N.. Pontificia Universidad Javeriana; ColombiaFil: Vasconcelos, Heraldo L.. Universidade Federal de Uberlandia; BrasilFil: Wearn, Oliver. Imperial College London; Reino Unido. The Zoological Society of London; Reino UnidoFil: Wells, Konstans. University of Adelaide; AustraliaFil: Willig, Michael R.. University of Connecticut; Estados UnidosFil: Wood, Eric. University of Wisconsin; Estados UnidosFil: Young, Richard P.. Durrell Wildlife Conservation Trust; Reino UnidoFil: Bradley, Andrew V.. Imperial College London; Reino UnidoFil: Ewers, Robert M.. Imperial College London; Reino Unid

    BIOFRAG - a new database for analyzing BIOdiversity responses to forest FRAGmentation

    Get PDF
    Peer reviewe
    corecore